The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment

We introduce a novel optimization problem to support the planning and routing of on-demand buses in an urban context. call this bus (ODBRP). Given are fleet with fixed capacity, set stations travel times between them, transportation requests. Each request consists potential departure arrival stations, as well time window, that is, earliest latest time. The aim ODBRP is (1) assign each passenger station (2) develop routes fulfill while minimizing total all users. present static version ODBRP, straightforward large neighborhood search heuristic solve it. performance established by comparing it off-the-shelve solver (LocalSolver). also use our (slightly modified instances of) well-known dial-a-ride problem. results found for system compared those simulated traditional public lines timetables. A thorough analysis comparison demonstrates user ride can be significantly lower shows works best number small buses.